A Model and Algorithm for Computing Minimum-Size Test Patterns
نویسندگان
چکیده
This paper addresses the problem of test pattern generation for single stuck-at faults in combinational circuits, under the additional constraint that the number of specified primary input assignments is minimized. This problem has different applications in testing, including the identification of don’t care conditions to be used in the synthesis of Built-In SelfTest (BIST) logic. The proposed solution is based on an integer linear programming (ILP) formulation which builds on an existing Propositional Satisfiability (SAT) model for test pattern generation. This ILP formulation is linear on the size of the original SAT model for test generation, which is linear on the size of the circuit. Nevertheless, the resulting ILP instances represent complex optimization problems, that require dedicated ILP algorithms. Preliminary results on benchmark circuits validate the practical applicability of the test pattern minimization model and associated ILP algorithm.
منابع مشابه
A SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملOn Computing Minimum Size Prime Implicants
In this paper we describe a new model and algorithm for computing minimum-size prime implicants of Boolean functions. The computation of minimum-size prime implicants has several applications in different areas, including Electronic Design Automation (EDA), Non-Monotonic Reasoning, Logical Inference, among others. For EDA, one significant and immediate application is the computation of minimum-...
متن کاملIntegrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کامل